Flexible disk scheduling for multimedia presentation servers

نویسندگان

  • Sindhu Emilda
  • Lillykutty Jacob
  • Ovidiu Daescu
  • B. Prabhakaran
چکیده

Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author(s). Hence, even discrete media objects (that do not normally have any real-time characteristics) have temporal constraints on their presentations. Composition of multimedia presentations can vary widely. Based on their composition, we can consider three broad categories of multimedia presentations: heavy, medium, and light. Heavy multimedia presentations comprise video and audio for the entire duration along with text and images. Medium multimedia presentations are composed of text, images, audio, and short video clips, distributed over the entire duration of the presentations. Light multimedia presentations consist of mostly text, images, and audio. There may not be any video clips (if there are, then very few) as part of the multimedia presentation. This varying nature of the composition of multimediapresentations provides some flexibility for scheduling their retrieval. Depending on the composition of multimedia presentations, disk access for retrieval may not be needed in every round. For instance, a medium multimedia presentation may need few slots once in, say, every fivelsix rounds, since the client will take time to consume (view) the presentation. Hence, a presentation can skip a certain number of disk scheduling rounds before retrieving the next required chunk of data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Performance Tradeoffs in Clustered Video Servers

In this paper, we investigate the suitability of clustered architectures for designing scalable multimedia servers. Specifically, we evaluate the effects of: (i) architectural design of the cluster, (ii) the size of the unit of data interleaving, and (iii) read-ahead buffering and scheduling on the real-time performance guarantees provided by the server. To analyze the effects of these paramete...

متن کامل

An Observation-Based Admission Control Algorithm for Multimedia Servers

In this paper, we propose a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server only if the predicted extrapolation from the status quo measurements of the storage server utilization indicate that the service requirements of all the clients can be met satisfactorily. The performance of the admission control algorithm, and hence, ...

متن کامل

A Multi-level Buffering and Feedback Scheme for Distributed Multimedia Presentation Systems

Distributed multimedia presentation systems require flexibility and good quality of service for multimedia data presentations. To ensure flexible and satisfiable presentations of multimedia data, collaborations between servers, network, and clients must be carefully designed to retrieve the data from the disk and transfer the data to the client. In this paper, we investigate a multi-level buffe...

متن کامل

I/O Channel and Real-Time Disk Schedulingfor Video Servers

multimedia, VOD, real-time disk scheduling A video server is one of the key components in providing the "videoon-demand" service. This service allows the delivery of movies (or games, sports, news, etc.) to homes on viewers' requests. Video servers are different from traditional file servers or database systems in the following major aspects: they have large storage capacity, must support inten...

متن کامل

Disk Scheduling in Video Editing Systems

Modern video servers support both video-on-demand and non-linear editing applications. Video-on-demand servers enable the user to view video clips or movies from a video database, while non-linear editing systems enable the user to manipulate the content of the video database. Applications such as video and news editing systems require that the underlying storage server be able to concurrently ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002